When is $${\mathfrak {m}}:{\mathfrak {m}}$$ an almost Gorenstein ring?

نویسندگان

چکیده

Given a one-dimensional Cohen-Macaulay local ring $$(R,{\mathfrak {m}},k)$$ , we prove that it is almost Gorenstein if and only $${\mathfrak {m}}$$ canonical module of the {m}}:{\mathfrak . Then, generalize this result by introducing notions ideal gAGL proving R an We use fact to characterize when Gorenstein, provided has minimal multiplicity. This generalization proved Chau, Goto, Kumashiro, Matsuoka in case which its residue field isomorphic k.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX

This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...

متن کامل

When is the ring of real measurable functions a hereditary ring?

‎Let $M(X‎, ‎mathcal{A}‎, ‎mu)$ be the ring of real-valued measurable functions‎ ‎on a measure space $(X‎, ‎mathcal{A}‎, ‎mu)$‎. ‎In this paper‎, ‎we characterize the maximal ideals in the rings of real measurable functions‎ ‎and as a consequence‎, ‎we determine when $M(X‎, ‎mathcal{A}‎, ‎mu)$ is a hereditary ring.

متن کامل

When is an Almost Monochromatic K4 Guaranteed?

Suppose that n > (log k), where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges receive at most two colors. This improves the previous best bound of k k, where c′ is a fixed positive constant, which follows from results on classical Ramsey numbers.

متن کامل

When Piecewise Determinism Is Almost True

Most existing log-based recovery techniques assume perfect piecewise determinism. In practice, however, the behavior of certain events is determined by the execution environment, and is not replayble. In this paper , we introduce a probabilistic piecewise determinis-tic model, and develop a probability tracking mechanism to achieve high-conndence output commits. The paper also addresses the iss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista Matematica Complutense

سال: 2021

ISSN: ['1696-8220', '1139-1138', '1988-2807']

DOI: https://doi.org/10.1007/s13163-021-00414-x